Single Machine Group Scheduling with Resource Dependent Setup and Processing Times
Identifieur interne : 009128 ( Main/Exploration ); précédent : 009127; suivant : 009129Single Machine Group Scheduling with Resource Dependent Setup and Processing Times
Auteurs : Adam Janiak ; Mikhail Y. Kovalyov ; Marie-Claude PortmannSource :
English descriptors
- KwdEn :
Abstract
A single machine scheduling problem is studied. The set of n jobs has been partitioned into g groups on the basis of group technology. Jobs of the same group are required to be processed contiguously. The processing of each group is preceeded by a sequence independent setup time. The setup times and the job processing times can be linearly compressed through allocation of a continuously divisible or discrete resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource, which may be different from that of the jobs. Polynomial time algorihms are presented to find an optimal job sequence and resource values such that the total weighted resource consumption is minimum, subject to meeting job deadlines. The algorithms are based on solving linear programming problems with two variables by geometric techniques.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002F01
- to stream Crin, to step Curation: 002F01
- to stream Crin, to step Checkpoint: 001744
- to stream Main, to step Merge: 009649
- to stream Main, to step Curation: 009128
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="158">Single Machine Group Scheduling with Resource Dependent Setup and Processing Times</title></titleStmt><publicationStmt><idno type="RBID">CRIN:janiak01c</idno><date when="2001" year="2001">2001</date><idno type="wicri:Area/Crin/Corpus">002F01</idno><idno type="wicri:Area/Crin/Curation">002F01</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002F01</idno><idno type="wicri:Area/Crin/Checkpoint">001744</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001744</idno><idno type="wicri:Area/Main/Merge">009649</idno><idno type="wicri:Area/Main/Curation">009128</idno><idno type="wicri:Area/Main/Exploration">009128</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Single Machine Group Scheduling with Resource Dependent Setup and Processing Times</title><author><name sortKey="Janiak, Adam" sort="Janiak, Adam" uniqKey="Janiak A" first="Adam" last="Janiak">Adam Janiak</name></author><author><name sortKey="Kovalyov, Mikhail Y" sort="Kovalyov, Mikhail Y" uniqKey="Kovalyov M" first="Mikhail Y." last="Kovalyov">Mikhail Y. Kovalyov</name></author><author><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>deadlines</term><term>group technology</term><term>linear programming</term><term>resource allocation</term><term>single machine scheduling</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1556">A single machine scheduling problem is studied. The set of n jobs has been partitioned into g groups on the basis of group technology. Jobs of the same group are required to be processed contiguously. The processing of each group is preceeded by a sequence independent setup time. The setup times and the job processing times can be linearly compressed through allocation of a continuously divisible or discrete resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource, which may be different from that of the jobs. Polynomial time algorihms are presented to find an optimal job sequence and resource values such that the total weighted resource consumption is minimum, subject to meeting job deadlines. The algorithms are based on solving linear programming problems with two variables by geometric techniques.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Janiak, Adam" sort="Janiak, Adam" uniqKey="Janiak A" first="Adam" last="Janiak">Adam Janiak</name><name sortKey="Kovalyov, Mikhail Y" sort="Kovalyov, Mikhail Y" uniqKey="Kovalyov M" first="Mikhail Y." last="Kovalyov">Mikhail Y. Kovalyov</name><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 009128 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 009128 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:janiak01c
|texte= Single Machine Group Scheduling with Resource Dependent Setup and Processing Times
}}
| This area was generated with Dilib version V0.6.33. |  |